A memetic algorithm for minimizing the total weighted completion time on a single machine under linear deterioration
نویسندگان
چکیده
منابع مشابه
Minimizing total weighted completion time approximately for the parallel machine problem with a single server
In this paper, we consider the scheduling problem of minimizing total weighted job completion time when a set of jobs has to be processed on a set of m parallel identical machines with a common server. We propose an approximation algorithm with a worst-case ratio of 3− 1 m . This result improves an existing (5− 1 m ) approximation algorithm given by Wang and Cheng (2001).
متن کاملOnline heuristic for the preemptive single machine scheduling problem of minimizing the total weighted completion time
1Laboratory of Algorithms and Technologies for Networks Analysis National Research University Higher School of Economics 136 Rodionova street, Niznhy Novgorod 603093, Russia 2Department of Industrial and Systems Engineering, University of Florida 303 Weil Hall, Gainesville, FL, 32611, USA 3Department of Operations Management & Operations Research, University of Groningen Nettelbosje 2, 9747 AE ...
متن کاملAn FPTAS of Minimizing Total Weighted Completion Time on Single Machine with Position Constraint
In this paper we study the classical scheduling problem of minimizing the total weighted completion time on a single machine with the constraint that one specific job must be scheduled at a specified position. We give dynamic programs with pseudo-polynomial running time, and a fully polynomial-time approximation scheme (FPTAS). 1998 ACM Subject Classification F.2.2
متن کاملApproximation schemes for minimizing total (weighted) completion time with release dates on a batch machine
A batch machine is a machine that can process a number of jobs simultaneously as a batch, and the processing time of a batch is equal to the longest processing time of the jobs assigned to it. In this paper we present a polynomial time approximation scheme (PTAS) for scheduling a batch machine to minimize the total completion time with job release dates. Also, we present a fully polynomial time...
متن کاملA New ILP Model for Identical Parallel-Machine Scheduling with Family Setup Times Minimizing the Total Weighted Flow Time by a Genetic Algorithm
This paper presents a novel, integer-linear programming (ILP) model for an identical parallel-machine scheduling problem with family setup times that minimizes the total weighted flow time (TWFT). Some researchers have addressed parallel-machine scheduling problems in the literature over the last three decades. However, the existing studies have been limited to the research of independent jobs,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematical Modelling
سال: 2010
ISSN: 0307-904X
DOI: 10.1016/j.apm.2010.01.002